Inertial extragradient algorithms with non-monotonic step sizes for solving variational inequalities and fixed point problems
نویسندگان
چکیده
In this paper, we introduce four inertial extragradient algorithms with non-monotonic step sizes to find the solution of convex feasibility problem, which consists a monotone variational inequality problem and fixed point demicontractive mapping. Strong convergence theorems suggested are established under some standard conditions. Finally, implement computational tests show efficiency advantages proposed compare them existing ones.
منابع مشابه
A Hybrid Extragradient Method for Solving Ky Fan Inequalities, Variational Inequalities and Fixed Point Problems
The purpose of this paper is to introduce a new hybrid extragradient iterative method for finding a common element of the set of points satisfying the Ky Fan inequalities, variational inequality and the set of fixed points of a strict pseudocontraction mapping in Hilbert spaces. Consequently, we obtain the strong convergence of an iterative algorithm generated by the hybrid extragradient projec...
متن کاملHybrid Extragradient Iterative Algorithms for Variational Inequalities, Variational Inclusions, and Fixed-Point Problems
We investigate the problem of finding a common solution of a general system of variational inequalities, a variational inclusion, and a fixed-point problem of a strictly pseudocontractive mapping in a real Hilbert space. Motivated by Nadezhkina and Takahashi’s hybrid-extragradient method, we propose and analyze new hybrid-extragradient iterative algorithm for finding a common solution. It is pr...
متن کاملThe Mann-Type Extragradient Iterative Algorithms with Regularization for Solving Variational Inequality Problems, Split Feasibility, and Fixed Point Problems
and Applied Analysis 3 open topic. For example, it is yet not clear whether the dual approach to (7) of [29] can be extended to the SFP. The original algorithm given in [15] involves the computation of the inverse A (assuming the existence of the inverse of A), and thus has not become popular. A seemingly more popular algorithm that solves the SFP is the CQ algorithm of Byrne [16, 21] which is ...
متن کاملIterative Algorithms Approach to Variational Inequalities and Fixed Point Problems
and Applied Analysis 3 for all x, y ∈ C. A mapping A : C → H is said to be α-inverse strongly g-monotone if and only if 〈 Ax −Ay, g x − gy ≥ α∥Ax −Ay∥2, 2.2 for some α > 0 and for all x, y ∈ C. A mapping g : C → C is said to be strongly monotone if there exists a constant γ > 0 such that 〈 g x − gy, x − y ≥ γ∥x − y∥2, 2.3 for all x, y ∈ C. Let B be a mapping ofH into 2 . The effective domain of...
متن کاملAn extragradient-like approximation method for variational inequalities and fixed point problems
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping in the intermediate sense and the set of solutions of a variational inequality problem for a monotone and Lipschitz continuous mapping. We introduce an extragradient-like iterative algorithm that is based on the extragradient-like a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in operator theory
سال: 2021
ISSN: ['2538-225X', '2662-2009']
DOI: https://doi.org/10.1007/s43036-021-00155-0